Solving Unconstrained Optimization Problems by a New Conjugate Gradient Method with Sufficient Descent Property
نویسندگان
چکیده
There have been some conjugate gradient methods with strong convergence but numerical instability and conversely. Improving these is an interesting idea to produce new both and numerical stability. In this paper, a hybrid method introduced based on the Fletcher formula (CD) Liu Storey formula (LS) good results. New directions satisfy sufficient descent property, independent of line search. Under mild assumptions, the global proved. Numerical results unconstrained CUTEst test problems show that algorithm very robust efficient.
منابع مشابه
A New Sufficient Descent Conjugate Gradient Method for Unconstrained Optimization
In this paper, a new conjugate conjugate method with sufficient descent property is proposed for the unconstrained optimization problem. An attractive property of the new method is that the descent direction generated by the method always possess the sufficient descent property, and this property is independent of the line search used and the choice of ki . Under mild conditions, the global c...
متن کاملA Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
Conjugate gradient methods are widely used for solving large-scale unconstrained optimization problems, because they do not need the storage of matrices. In this paper, we propose a general form of three-term conjugate gradient methods which always generate a sufficient descent direction. We give a sufficient condition for the global convergence of the proposed general method. Moreover, we pres...
متن کاملA New Descent Nonlinear Conjugate Gradient Method for Unconstrained Optimization
In this paper, a new nonlinear conjugate gradient method is proposed for large-scale unconstrained optimization. The sufficient descent property holds without any line searches. We use some steplength technique which ensures the Zoutendijk condition to be held, this method is proved to be globally convergent. Finally, we improve it, and do further analysis.
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملModified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
In this paper, an efficient modified nonlinear conjugate gradient method for solving unconstrained optimization problems is proposed. An attractive property of the modified method is that the generated direction in each step is always descending without any line search. The global convergence result of the modified method is established under the general Wolfe line search condition. Numerical r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ma?allat? ??mi?at? al-Sul??n Q?b?s li-l-?ul?m
سال: 2022
ISSN: ['2308-3921', '2414-536X']
DOI: https://doi.org/10.53539/squjs.vol27iss2pp90-99